Enumerating permutation polynomials
نویسندگان
چکیده
We consider the problem of enumerating polynomials over Fq, that have certain coefficients prescribed to given values and permute certain substructures of Fq. In particular, we are interested in the group of N -th roots of unity and in the submodules of Fq. We employ the techniques of Konyagin and Pappalardi to obtain results that are similar to their results in [Finite Fields and their Applications, 12(1):26–37, 2006]. As a consequence, we prove conditions that ensure the existence of low-degree permutation polynomials of the mentioned substructures of Fq.
منابع مشابه
Enumerating Permutation Polynomials over Finite Fields by Degree
fσ has the property that fσ(a) = σ(a) for every a ∈ Fq and this explains its name. For an account of the basic properties of permutation polynomials we refer to the book of Lidl and Niederreiter [5]. From the definition, it follows that for every σ ∂(fσ) ≤ q − 2. A variety of problems and questions regarding Permutation polynomials have been posed by Lidl and Mullen in [3, 4]. Among these there...
متن کاملEnumerating permutation polynomials over finite fields by degree II
This note is a continuation of a paper by the same authors that appeared in 2002 in the same journal. First we extend the method of the previous paper proving an asymptotic formula for the number of permutations for which the associated permutation polynomial has d coefficients in specified fixed positions equal to 0. This also applies to the function Nq,d that counts the number of permutations...
متن کاملEnumerating Permutation Polynomials I:Permutations with Non-Maximal Degree
Let C be a conjugation class of permutations of a finite field Fq. We consider the function NCðqÞ defined as the number of permutations in C for which the associated permutation polynomial has degree 5q 2. In 1969, Wells proved a formula for N1⁄23 ðqÞ where 1⁄2k denotes the conjugation class of k-cycles. We will prove formulas for N1⁄2k ðqÞ where k 1⁄4 4; 5; 6 and for the classes of permutation...
متن کاملCorrigendum to "enumerating permutation polynomials - I: Permutations with non-maximal degree": [Finite Fields Appl. 8 (2002) 531-547]
Let Fq be a finite field with q elements and suppose C is a conjugation class of permutations of the elements of Fq . We denote by C = (c1; c2; . . . ; ct ) the conjugation class of permutations that admit a cycle decomposition with ci i-cycles (i = 1, . . . , t). Further, we set c = 2c2+· · ·+ tct = q−c1 to be the number of elements of Fq moved by any permutation in C. If ∈ C, then the permuta...
متن کاملEnumerating Permutations Avoiding a Pair of Babson-steingŕımsson Patterns
Babson and Steingŕımsson introduced generalized permutation patterns that allow the requirement that two adjacent letters in a pattern must be adjacent in the permutation. Subsequently, Claesson presented a complete solution for the number of permutations avoiding any single pattern of type (1, 2) or (2, 1). For eight of these twelve patterns the answer is given by the Bell numbers. For the rem...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Finite Fields and Their Applications
دوره 47 شماره
صفحات -
تاریخ انتشار 2017